On the rank of Hankel matrices over finite fields

نویسندگان

چکیده

Given three nonnegative integers $p,q,r$ and a finite field $F$, how many Hankel matrices $\left( x_{i+j}\right) _{0\leq i\leq p,\ 0\leq j\leq q}$ over $F$ have rank $\leq r$ ? This question is classical, the answer ($q^{2r}$ when $r\leq\min\left\{ p,q\right\} $) has been obtained independently by various authors using different tools (Daykin, Elkies, Garcia Armas, Ghorpade Ram). In this note, we study refinement of result: We show that if fix first $k$ entries $x_{0},x_{1},\ldots,x_{k-1}$ for some $k\leq r\leq\min\left\{ $, then number ways to choose remaining $p+q-k+1$ $x_{k},x_{k+1},\ldots,x_{p+q}$ such resulting matrix $q^{2r-k}$. exactly one would expect had no effect on rank, but course situation not simple. The refined result generalizes (and provides an alternative proof of) Anzis, Chen, Gao, Kim, Li Patrias evaluations Jacobi-Trudi determinants fields.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Rank Problems for Subspaces of Matrices over Finite Fields

In this thesis we are concerned with themes suggested by rank properties of subspaces of matrices. Historically, most work on these topics has been devoted to matrices over such fields as the real or complex numbers, where geometric or analytic methods may be applied. Such techniques are not obviously applicable to finite fields, and there were very few general theorems relating to rank problem...

متن کامل

Relatively prime polynomials and nonsingular Hankel matrices over finite fields

The probability for two monic polynomials of a positive degree n with coefficients in the finite field Fq to be relatively prime turns out to be identical with the probability for an n × n Hankel matrix over Fq to be nonsingular. Motivated by this, we give an explicit map from pairs of coprime polynomials to nonsingular Hankel matrices that explains this connection. A basic tool used here is th...

متن کامل

The rank of sparse random matrices over finite fields

Let M be a random matrix over GFq] such that for each entry M ij in M and for each non-zero eld element the probability PrrM ij = ] is p=(q ? 1), where p = (log n ? c)=n and c is an arbitrary but xed positive constant. The probability for a matrix entry to be zero is 1?p. It is shown that the expected rank of M is n ? O(1): Furthermore, there is a constant A such that the probability that the r...

متن کامل

Computing the Rank of Large Sparse Matrices over Finite Fields

We want to achieve efficient exact computations, such as the rank, of sparse matrices over finite fields. We therefore compare the practical behaviors, on a wide range of sparse matrices of the deterministic Gaussian elimination technique, using reordering heuristics, with the probabilistic, blackbox, Wiedemann algorithm. Indeed, we prove here that the latter is the fastest iterative variant of...

متن کامل

NUMBER OF RANK r SYMMETRIC MATRICES OVER FINITE FIELDS

We determine the number of n×n symmetric matrices over GF (p) that have rank r for 0 ≤ r ≤ n. In [BM2] Brent and McKay determine the number of n × n symmetric matrices over Zp that have determinant zero. Thus they determine the number of n× n symmetric matrices over Zp that have rank n. We extend their result to symmetric matrices over GF (p) and we determine the number of matrices that have ra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2022

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2022.02.014